On Bounded-Degree Vertex Deletion parameterized by treewidth
نویسندگان
چکیده
منابع مشابه
On Bounded-Degree Vertex Deletion parameterized by treewidth
Given an undirected graph G and an integer d ≥ 0, the NP-hard BoundedDegree Vertex Deletion problem asks to delete as few vertices as possible from G such that the resulting graph has maximum vertex degree d. Our main result is to prove that Bounded-Degree Vertex Deletion is W[1]-hard with respect to the parameter treewidth. As a side result, we obtain that the NP-hard Vector Dominating Set pro...
متن کاملA Parameterized Algorithm for Bounded-Degree Vertex Deletion
The d-bounded-degree vertex deletion problem, to delete at most k vertices in a given graph to make the maximum degree of the remaining graph at most d, finds applications in computational biology, social network analysis and some others. It can be regarded as a special case of the (d+2)-hitting set problem and generates the famous vertex cover problem. The d-bounded-degree vertex deletion prob...
متن کاملTREEWIDTH and PATHWIDTH parameterized by vertex cover
After the number of vertices, Vertex Cover is the largest of the classical graph parameters and has more and more frequently been used as a separate parameter in parameterized problems, including problems that are not directly related to the Vertex Cover. Here we consider the TREEWIDTH and PATHWIDTH problems parameterized by k, the size of a minimum vertex cover of the input graph. We show that...
متن کاملOn Directed Feedback Vertex Set parameterized by treewidth
We study the Directed Feedback Vertex Set problem parameterized by the treewidth of the input graph. We prove that unless the Exponential Time Hypothesis fails, the problem cannot be solved in time 2 log t) · n on general directed graphs, where t is the treewidth of the underlying undirected graph. This is matched by a dynamic programming algorithm with running time 2 log t) · n. On the other h...
متن کاملOn Making a Distinguished Vertex Minimum Degree by Vertex Deletion
For directed and undirected graphs, we study the problem to make a distinguished vertex the unique minimum-(in)degree vertex through deletion of a minimum number of vertices. The corresponding NP-hard optimization problems are motivated by applications concerning control in elections and social network analysis. Continuing previous work for the directed case, we show that the problem is W[2]-ha...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Discrete Applied Mathematics
سال: 2012
ISSN: 0166-218X
DOI: 10.1016/j.dam.2011.08.013